The average weight distribution of a regular low-density parity-check (LDPC)code ensemble over a finite field is thoroughly analyzed. In particular, aprecise asymptotic approximation of the average weight distribution is derivedfor the small-weight case, and a series of fundamental qualitative propertiesof the asymptotic growth rate of the average weight distribution are proved.Based on this analysis, a general result, including all previous results asspecial cases, is established for the minimum distance of individual codes in aregular LDPC code ensemble.
展开▼
